UVa/10005 - Packing polygons/10005.cpp

   1 #include <iostream>
   2 #include <cmath>
   3
   4 using namespace std;
   5
   6 struct point{
   7   int x, y;
   8 };
   9
  10 int main(){
  11   int n;
  12   while (cin >> n && n){
  13     point p[n];
  14     for (int i=0; i<n; ++i){
  15       cin >> p[i].x >> p[i].y;
  16     }
  17     double r;
  18     cin >> r;
  19
  20     double longest = 0.0;
  21     for (int i=0; i<n; ++i){
  22       for (int j=i+1; j<n; ++j){
  23         longest = max(longest, hypot(p[i].x - p[j].x, p[i].y - p[j].y));
  24       }
  25     }
  26     if (longest < 2*r){
  27       cout << "The polygon can be packed in the circle." << endl;
  28     }else{
  29       cout << "There is no way of packing that polygon." << endl;
  30     }
  31   }
  32   return 0;
  33 }